Generalized penetration depth computation based on kinematical geometry
نویسندگان
چکیده
منابع مشابه
Generalized penetration depth computation based on kinematical geometry
The generalized penetration depth PD of two overlapping bodies X and Y is the distance between the given colliding position of X and the closest collision-free Euclidean copy Xε to X according to a distance metric. We present geometric optimization algorithms for the computation of PD with respect to an object-oriented metric S which takes the mass distribution of the moving body X into conside...
متن کاملEfficient Motion Planning using Generalized Penetration Depth Computation
Liangjun Zhang: Efficient Motion Planning using Generalized Penetration Depth Computation. (Under the direction of Dinesh Manocha.) Motion planning is a fundamental problem in robotics and also arises in other applications including virtual prototyping, navigation, animation and computational structural biology. It has been extensively studied for more than three decades, though most practical ...
متن کاملA Fast and Practical Algorithm for Generalized Penetration Depth Computation
We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the minimal translational and rotational motion that separates the two objects. We formulate the PDg computation based on modeldependent distance metrics using displacement vectors. As a result, our formulation is independent...
متن کاملFast Penetration Depth Computation and its Applications
In this paper, we highlight our past experiences on fast penetration depth computation and its applications in different areas such as physically-based animation, 6DOF haptic rendering and robot motion planning.
متن کاملProximity Queries and Penetration Depth Computation on 3D Game Objects
This paper discusses methods for performing proximity queries (collision detection, distance computation) and penetration depth computation on a large class of convex objects. The penetration depth of a pair of intersecting objects is the shortest vector over which one object needs to be translated in order to bring the pair in touching contact. The class of objects includes convex primitives s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Aided Geometric Design
سال: 2009
ISSN: 0167-8396
DOI: 10.1016/j.cagd.2009.01.001